Edge Clique Partition of K 4-Free and Planar Graphs
نویسندگان
چکیده
Edge k-Clique Partition (k-ECP) is the problem of dividing the edge set of an undirected graph into a set of at most k edgedisjoint cliques, where k ≥ 1 is an input parameter. The problem is NP-hard but in FPT. We propose several improved FPT algorithms for k-ECP on K4-free graphs, planar graphs, and cubic graphs.
منابع مشابه
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint subsets V1, V2, . . . , Vk such that the subgraph induced by each part Vi is a complete subgraph (clique) of G. In this paper, we establish both the NP-completeness of PIC for planar cubic graphs and the Max SNP-hardness ...
متن کاملThe Difference between the Clique Numbers of a Graph
Let G be a simple graph . Its clique covering (partition) number cc(G) (cp(G)) is the least number of complete subgraphs needed to cover (partition) its edge-set . We study the function o(G) cp(G) cc(G) of graphs G . l . Introduction and Summary Let G be a simple graph on n ? 1 vertices . The clique partition [covering] number co(G) [cc(G)] is the least number of cliques (complete subgraphs of ...
متن کاملOn the complexity of edge-colored subgraph partitioning problems in network optimization
Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network optimization. Recently, labeled network optimization over colored graphs has been extensively studied. Given a (not necessarily properly) edge-colored gr...
متن کاملIndependent sets in edge-clique graphs II
We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in polynomial time. We show that the independent set problem on edge-clique ...
متن کاملSubcolorings and the subchromatic number of a graph
We consider the subchromatic number χS(G) of graph G, which is the minimum order of all partitions of V (G) with the property that each class in the partition induces a disjoint union of cliques. Here we establish several bounds on subchromatic number. For example, we consider the maximum subchromatic number of all graphs of order n and in so doing answer a question posed in [20]. We also consi...
متن کامل